Support Vectors Selection by Linear Programming
نویسندگان
چکیده
A linear programming (LP) based method is proposed for learning from experimental data in solving the nonlinear regression and classification problems. LP controls both the number of basis functions in a neural network (i.e., support vector machine) and the accuracy of learning machine. Two different methods are suggested in regression and their equivalence is discussed. Examples of function approximation and classification (pattern recognition) illustrate the efficiency of the proposed method.
منابع مشابه
A MODIFIED METHOD TO DETERMINE A WELL-DISPERSED SUBSET OF NON-DOMINATED VECTORS OF AN MOMILP PROBLEM
This paper uses the L1−norm and the concept of the non-dominated vector, topropose a method to find a well-dispersed subset of non-dominated (WDSND) vectorsof a multi-objective mixed integer linear programming (MOMILP) problem.The proposed method generalizes the proposed approach by Tohidi and Razavyan[Tohidi G., S. Razavyan (2014), determining a well-dispersed subset of non-dominatedvectors of...
متن کاملA Comprehensive Model for R and D Project Portfolio Selection with Zero-One Linear Goal-Programming (RESEARCH NOTE)
Technology centered organizations must be able to identify promising new products or process improvements at an early stage so that the necessary resources can be allocated to those activities. It is essential to invest in targeted research and development (R and D) projects as opposed to a wide range of ideas so that resources can be focused on successful outcomes. The selection of the most ap...
متن کاملPrimal-Dual Framework for Feature Selection using Least Squares Support Vector Machines
Least Squares Support Vector Machines (LSSVM) perform classification using L2-norm on the weight vector and a squared loss function with linear constraints. The major advantage over classical L2-norm support vector machine (SVM) is that it solves a system of linear equations rather than solving a quadratic programming problem. The L2norm penalty on the weight vectors is known to robustly select...
متن کاملA new method to determine a well-dispersed subsets of non-dominated vectors for MOMILP problem
Multi-objective optimization is the simultaneous consideration of two or more objective functions that are completely or partially inconflict with each other. The optimality of such optimizations is largely defined through the Pareto optimality. Multiple objective integer linear programs (MOILP) are special cases of multiple criteria decision making problems. Numerous algorithms have been desig...
متن کاملA weighted Additive Fuzzy Programming Approach for Logistics Outsourcing Selection in Car Industry
Logistics outsourcing has been at the top of the management agenda during recent decades. The selection of the proper service supplier is the key to success in logistic outsourcing Firms could select the right supplier by applying appropriate methods and selection criteria. In this paper a new framework is proposed on the basis of weighted additive fuzzy programming approach and linear programm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000